Computing unsatisfiable k-SAT instances with few occurrences per variableHOORY, Shlomo; SZEIDER, Stefan.Theoretical computer science. 2005, Vol 337, Num 1-3, pp 347-359, issn 0304-3975, 13 p.Article

A note on unsatisfiable κ-CNF formulas with few occurrences per variableHOORY, Shlomo; SZEIDER, Stefan.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 2, pp 523-528, issn 0895-4801, 6 p.Article

Monotone circuits for the majority functionHOORY, Shlomo; MAGEN, Avner; PITASSI, Toniann et al.Lecture notes in computer science. 2006, pp 410-425, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 16 p.Conference Paper

Simple permutations mix wellHOORY, Shlomo; MAGEN, Avner; MYERS, Steven et al.Theoretical computer science. 2005, Vol 348, Num 2-3, pp 251-261, issn 0304-3975, 11 p.Conference Paper

Simple permutations mix wellHOORY, Shlomo; MAGEN, Avner; MYERS, Steven et al.Lecture notes in computer science. 2004, pp 770-781, issn 0302-9743, isbn 3-540-22849-7, 12 p.Conference Paper

Reducing the size of resolution proofs in linear timeBAR-ILAN, Omer; FUHRMANN, Oded; HOORY, Shlomo et al.International journal on software tools for technology transfer (Print). 2011, Vol 13, Num 3, pp 263-272, issn 1433-2779, 10 p.Article